Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

论火灾与可持续发展观的内在联系

可持续发展是人类迫切解决的问题,火灾对可持续发展构成巨大威胁.针对火灾的危害,从防灾角度研究可持续发展观,揭示火灾与可持续发展的内在联系,为人类有效控制火灾提供正确的认识论和科学的方法论.     

A note on “resource flexibility with responsive pricing”

We revisit the capacity investment decision problem studied in the article “Resource Flexibility with Responsive Pricing” by Chod and Rudi [Operations Research 53, (2005) 532–548]. A monopolist firm producing two dependent (substitutable or complementary) products needs to determine the capacity of one flexible resource under demand risk so as to maximize its expected profit. Product demands are linear functions of the prices of both products, and the market potentials are random and correlated. We perform a comparative statics analysis on how demand variability and correlation impact the optimal capacity and the resulting expected profit. In particular, C&R study this problem under the following assumptions/approximations: (i) demand intercepts follow a bivariate Normal distribution; (ii) demand uncertainty is of an additive form; (iii) and under approximate expressions for the optimal capacity and optimal expected profit. We revisit Propositions 2, 3, 4, 5, and 10 of C&R without these assumptions and approximations, and show that these results continue to hold (i) for the exact expressions for the optimal expected profit and optimal capacity, and (ii) under any arbitrary continuous distribution of demand intercepts. However, we also show that the additive demand uncertainty is a critical assumption for the C&R results to hold. In particular, we provide a case of multiplicative uncertainty under which the C&R results (Propositions 2 and 3) fail. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

高校资源环境类专业开设资源与环境法课程的意义

资源与环境法是高校法学类的核心课程，目前，该课程已经逐渐在资源环境类专业中不同程度的开设。高校资源环境类专业开设资源与环境法课程是非常必要而且很有意义的，（1）文章从开设资源与环境法课程有助于强化学生的环境法制教育；（2）开设资源与环境法课程有助于完善资源环境类专业的学科体系；（3）开设资源与环境法课程有利于大学生参与保护环境的实践活动；（4）开设资源与环境法课程有助于学生了解常识；（5）资源环境法课程的开设有利于丰富教学授课形式等5个方面论证了其意义性。     

基于网格技术的仿真资源实时调度系统研究与实现

针对仿真资源服务运行中存在的性能瓶颈,以WSR工厂模式为基础,设计并实现了一种基于网格技术的仿真资源实时调度系统。该系统通过设置代理工厂服务,在客户端创建资源实例,实现了对仿真资源服务的实时动态调度和对资源属性的监控。原型实验证明,该系统具有调度时机合理、调度机制对服务方与客户端透明、资源监控机制不影响客户端操作和接口开放等优点。     

基于语义的AdHoc网络服务发现

在分析现有的Ad Hoc网络服务发现方法的基础上,提出一种基于语义的Ad Hoc网络服务发现方法。该方法基于语义推理机制,能对服务进行准确地刻画,大大提高了查准率;又由于该方法在考虑服务本身的同时,还考虑了服务的节点属性和节点所处的环境属性,可以有效地改善服务质量。仿真结果表明,与同类的Ad Hoc网络服务发现方法相比,该方法在查准率方面具有较大的优越性。     

新疆民俗数学文化探析

新疆民俗数学是具有鲜明民族特色、独特价值和丰富文化内涵的数学思想与思维方式的综合。新疆民俗数学较多地体现在用于造型和装饰的清真寺、民居、民族手工艺品等方面的几何纹饰上。对于民俗数学的研究，一方面是通过对这些集数学知识与传统文化于一体的“文化载体”的搜集、整理和分析，分析其蕴含的数学知识和数学思想；另一方面则关注民俗数学研究成果的教育学转化，在充分考虑新疆少数民族儿童数学认知思维特征以及数学双语教学原则、方法等的基础上，通过实现民俗数学的“课程化”，以弥补当前新疆少数民地区以“主流文化”为主导的数学课程对少数民族传统文化的“缺失”，进而推进本地区基础教育课程改革和数学教育质量的提升。     

机务保障要求到保障方案转换

首先以装备可靠性为依据,以任务要求中任务时间、出动飞机数量、任务可靠度等参数为约束,建立了保障资源的配置模型;在确定保障资源配置基础上再以保障任务时间为优化目标,建立保障任务调度模型和调度算法,按照保障专业调度优化,为保障方案制定奠定了重要基础,对实行精确化保障有重要现实意义,对基层级的保障工作有很强的指导作用。     

A misclassification cost‐minimizing evolutionary–neural classification approach

Machine learning algorithms that incorporate misclassification costs have recently received considerable attention. In this paper, we use the principles of evolution to develop and test an evolutionary/genetic algorithm (GA)‐based neural approach that incorporates asymmetric Type I and Type II error costs. Using simulated, real‐world medical and financial data sets, we compare the results of the proposed approach with other statistical, mathematical, and machine learning approaches, which include statistical linear discriminant analysis, back‐propagation artificial neural network, integrated cost preference‐based linear mathematical programming‐based minimize squared deviations, linear integrated cost preference‐based GA, decision trees (C 5.0, and CART), and inexpensive classification with expensive tests algorithm. Our results indicate that the proposed approach incorporating asymmetric error costs results in equal or lower holdout sample misclassification cost when compared with the other statistical, mathematical, and machine learning misclassification cost‐minimizing approaches. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.